Some Remarks on Completeness, Connection Graph Resolution, and Link Deletion
Identifieur interne : 00B319 ( Main/Exploration ); précédent : 00B318; suivant : 00B320Some Remarks on Completeness, Connection Graph Resolution, and Link Deletion
Auteurs : Reiner H Hnle [Allemagne] ; Neil V. Murray [États-Unis] ; Erik Rosenthal [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A new completeness proof that generalizes the Anderson-Bledsoe excess literal argument is developed for connection-graph resolution. The technique also provides a simplified completeness proof for semantic resolution. Some observations about subsumption and about link deletion are made. Link deletion is the basis for connection graphs. Subsumption plays an important role in most resolution-based inference systems. In some settings—for example, connection graphs in negation normal form—both subsumption and link deletion can be quite tricky. Nevertheless, a completeness result that uses both is obtained in this setting.
Url:
DOI: 10.1007/3-540-69778-0_21
Affiliations:
- Allemagne, États-Unis
- Bade-Wurtemberg, Connecticut, District de Karlsruhe, État de New York
- Karlsruhe
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002B96
- to stream Istex, to step Curation: 002B59
- to stream Istex, to step Checkpoint: 002551
- to stream Main, to step Merge: 00BA41
- to stream Main, to step Curation: 00B319
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Some Remarks on Completeness, Connection Graph Resolution, and Link Deletion</title><author><name sortKey="H Hnle, Reiner" sort="H Hnle, Reiner" uniqKey="H Hnle R" first="Reiner" last="H Hnle">Reiner H Hnle</name></author><author><name sortKey="Murray, Neil V" sort="Murray, Neil V" uniqKey="Murray N" first="Neil V." last="Murray">Neil V. Murray</name></author><author><name sortKey="Rosenthal, Erik" sort="Rosenthal, Erik" uniqKey="Rosenthal E" first="Erik" last="Rosenthal">Erik Rosenthal</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B93EEAA78F2FDE79968054E469E33A7B8D39D3C0</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/3-540-69778-0_21</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-VS2FLJDX-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002B96</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002B96</idno><idno type="wicri:Area/Istex/Curation">002B59</idno><idno type="wicri:Area/Istex/Checkpoint">002551</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002551</idno><idno type="wicri:doubleKey">0302-9743:1998:H Hnle R:some:remarks:on</idno><idno type="wicri:Area/Main/Merge">00BA41</idno><idno type="wicri:Area/Main/Curation">00B319</idno><idno type="wicri:Area/Main/Exploration">00B319</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Some Remarks on Completeness, Connection Graph Resolution, and Link Deletion</title><author><name sortKey="H Hnle, Reiner" sort="H Hnle, Reiner" uniqKey="H Hnle R" first="Reiner" last="H Hnle">Reiner H Hnle</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Dept. of Computer Science, Univ. of Karlsruhe, 76128, Karlsruhe</wicri:regionArea><placeName><region type="land" nuts="1">Bade-Wurtemberg</region><region type="district" nuts="2">District de Karlsruhe</region><settlement type="city">Karlsruhe</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Murray, Neil V" sort="Murray, Neil V" uniqKey="Murray N" first="Neil V." last="Murray">Neil V. Murray</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Dept. of Computer Science, State Univ. of New York, 12222, Albany, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Rosenthal, Erik" sort="Rosenthal, Erik" uniqKey="Rosenthal E" first="Erik" last="Rosenthal">Erik Rosenthal</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Dept. of Mathematics, Univ. of New Haven, 300 Orange Avenue, 06516, West Haven, CT</wicri:regionArea><placeName><region type="state">Connecticut</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A new completeness proof that generalizes the Anderson-Bledsoe excess literal argument is developed for connection-graph resolution. The technique also provides a simplified completeness proof for semantic resolution. Some observations about subsumption and about link deletion are made. Link deletion is the basis for connection graphs. Subsumption plays an important role in most resolution-based inference systems. In some settings—for example, connection graphs in negation normal form—both subsumption and link deletion can be quite tricky. Nevertheless, a completeness result that uses both is obtained in this setting.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>États-Unis</li></country><region><li>Bade-Wurtemberg</li><li>Connecticut</li><li>District de Karlsruhe</li><li>État de New York</li></region><settlement><li>Karlsruhe</li></settlement></list><tree><country name="Allemagne"><region name="Bade-Wurtemberg"><name sortKey="H Hnle, Reiner" sort="H Hnle, Reiner" uniqKey="H Hnle R" first="Reiner" last="H Hnle">Reiner H Hnle</name></region><name sortKey="H Hnle, Reiner" sort="H Hnle, Reiner" uniqKey="H Hnle R" first="Reiner" last="H Hnle">Reiner H Hnle</name></country><country name="États-Unis"><region name="État de New York"><name sortKey="Murray, Neil V" sort="Murray, Neil V" uniqKey="Murray N" first="Neil V." last="Murray">Neil V. Murray</name></region><name sortKey="Murray, Neil V" sort="Murray, Neil V" uniqKey="Murray N" first="Neil V." last="Murray">Neil V. Murray</name><name sortKey="Rosenthal, Erik" sort="Rosenthal, Erik" uniqKey="Rosenthal E" first="Erik" last="Rosenthal">Erik Rosenthal</name><name sortKey="Rosenthal, Erik" sort="Rosenthal, Erik" uniqKey="Rosenthal E" first="Erik" last="Rosenthal">Erik Rosenthal</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B319 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B319 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:B93EEAA78F2FDE79968054E469E33A7B8D39D3C0
|texte= Some Remarks on Completeness, Connection Graph Resolution, and Link Deletion
}}
| This area was generated with Dilib version V0.6.33. |  |